Low-complexity trellis decoding of linear block codes - Communications, IEE Proceedings-
نویسندگان
چکیده
The authors introduce a new simple encoding technique which allows the design of a wide variety of linear block codes. They present a number of examples in which the most widely used codes (Reed-Muller, Hamming, Golay, optimum etc.) have been designed. They also introduce a novel trellis design procedure for the proposed codes. It is shown that the trellises of the designed codes are similar to the trellises of coset codes and allow low complexity soft maximum likelihood decoding.
منابع مشابه
ADAPTIVE NESTED TRELLIS DECODING FOR BLOCK CODES - Global Telecommunications Conference, 1994. GLOBECOM '94. 'Communications: The Global Bridge'., IE
A new adaptive trellis decoding technique for block codes is proposed. The technique is based on a recently introduced encoding technique which allows the design of almost all known linear codes together with their minimal trellises. The proposed adaptive trellis decoding technique allows t h e implementation of a single sof t maximum likelihood trellis decoder for decoding of different codes. ...
متن کاملTail-Biting Trellises of Block Codes: Trellis Complexity and Viterbi Decoding Complexity
Tail-biting trellises of linear and nonlinear block codes are addressed. We refine the information-theoretic approach of a previous work on conventional trellis representation, and show that the same ideas carry over to tail-biting trellises. We present lower bounds on the state and branch complexity profiles of these representations. These bounds are expressed in terms of mutual information be...
متن کاملAn Iterative Soft-Input Soft-Output Decoding Algorithm for Linear Block Codes
In this paper, reduced-complexity trellis-based soft-input soft-output (SISO) decoding of linear block codes is considered. A new low-weight subtrellis based SISO decoding algorithm for linear block code to achieve near optimal error performance with a significant reduction in decoding complexity is presented. The proposed scheme is suitable for iterative decoding of linear block codes when use...
متن کاملMAP algorithms for decoding linear block codes based on sectionalized trellis diagrams
The MAP algorithm is a trellis-based maximum a posteriori probability decoding algorithm. It is the heart of the turbo (or iterative) decoding which achieves an error performance near the Shannon limit. Unfortunately, the implementation of this algorithm requires large computation and storage. Furthermore, its forward and backward recursions result in long decoding delay. For practical applicat...
متن کاملExponential Error Bounds for Block Concatenated Codes with Tail Biting Trellis Inner Codes
Tail biting trellis codes and block concatenated codes are discussed from random coding arguments. An error exponent and decoding complexity for tail biting random trellis codes are shown. Then we propose a block concatenated code constructed by a tail biting trellis inner code and derive an error exponent and decoding complexity for the proposed code. The results obtained by the proposed code ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008